Coalgebraic Quantum Computation
نویسندگان
چکیده
منابع مشابه
Coalgebraic Quantum Computation
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of systems occuring in the field of quantum computation, using convex sets of density matrices as state spaces. This will allow us to derive a method to conver...
متن کاملCoalgebraic Semantics for Quantum Computation
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. In this thesis we will present a coalgebraic representation of systems occuring in the field of quantum computation. This will allow us to derive a method to convert quantum mechanical systems into simple...
متن کاملCoalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of a monad (powerset and distribution), in an obvious manner. It is shown that also quantum walks are coalgebras of a new monad, involving additional control structure. This new monad is also used to describe Turing mac...
متن کاملCoalgebraic Aspects of Bidirectional Computation
We have previously (Bx, 2014; MPC, 2015) shown that several state-based bx formalisms can be captured using monadic functional pro-gramming, using the state monad together with possibly other monadiceffects, giving rise to structures we have called monadic bx (mbx). Inthis paper, we develop a coalgebraic theory of state-based bx, and relatethe resulting coalgebraic structure...
متن کاملFibred Coalgebraic Logic and Quantum Protocols
Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions on different fibres. As this fibred setting will typically involve multiple signature functors, the logic incorporates a calculus of modalities enabling the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.158.3